#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL C(LL x){
   return x*(x-1)*(x-2)/6;
}
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL n,m;cin>>n>>m;
   n++;
   m++;
   LL ans=C(n*m)-m*C(n)-n*C(m);
   for(LL i=1;i<n;i++){
       for(LL j=1;j<m;j++){
           ans-=2*(__gcd(i,j)-1)*(n-i)*(m-j);
       }
   }
   cout<<ans<<"\n";
   return 0;
}
